package 二分查找;

public class x的平方根3 {
    //https://leetcode.cn/problems/sqrtx/description/
    public static int mySqrt1(int x) {
        int left = 1, right = x;
        while(left < right) {
            int mid = left + (right - left + 1) / 2;
            if((long)mid * mid <= x) left = mid;
            else right = mid - 1;
        }
        return right;
    }
    public static int mySqrt(int x) {
        if(x < 1) return 0;
        long left = 1, right = x;
        while (left < right) {
            long mid = left + (right - left + 1) / 2;
            if(mid * mid <= x) left = mid;
            else right = mid - 1;
        }
        return (int)left;
    }


    public static void main(String[] args) {
        mySqrt(2147395599);
    }
}
